class Solution1 {
    public int coinChange(int[] coins, int amount) {
        int n = coins.length;
        int[][] dp = new int[n+1][amount+1];
        for(int j = 1; j<=amount; j++) {
            dp[0][j] = 0x3f3f3f3f;
        }

        for(int i = 1; i<=n; i++) {
            for(int j = 1; j<=amount; j++) {
                dp[i][j] = dp[i-1][j];
                if(j >= coins[i-1])
                    dp[i][j] = Math.min(dp[i-1][j], dp[i][j-coins[i-1]] + 1);
            }
        }

        if(dp[n][amount] >= 0x3f3f3f3f) return -1;
        else return dp[n][amount];
    }
}

class Solution2 {
    public int coinChange(int[] coins, int amount) {
        int n = coins.length;
        int[] dp = new int[amount+1];
        for(int j = 1; j<=amount; j++) {
            dp[j] = 0x3f3f3f3f;
        }

        for(int i = 1; i<=n; i++) {
            for(int j = coins[i-1]; j<=amount; j++) {
                dp[j] = Math.min(dp[j], dp[j-coins[i-1]] + 1);
            }
        }

        if(dp[amount] >= 0x3f3f3f3f) return -1;
        else return dp[amount];
    }
}

class Solution {
    public int change(int amount, int[] coins) {
        int n = coins.length;
        int[][] dp = new int[n+1][amount+1];
        dp[0][0] = 1;

        for(int i = 1; i<=n; i++) {
            for(int j = 0; j<=amount; j++) {
                dp[i][j] = dp[i-1][j];
                if(j >= coins[i-1]) {
                    dp[i][j] += dp[i][j-coins[i-1]];
                }
            }
        }

        return dp[n][amount];
    }
}

public class Test {

}
